package test_3_19;

import java.util.HashSet;
import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 张杰
 * Date: 2022-03-19
 * Time: 14:59
 */
public class TestDemo {

    public static void main(String[] args) {
        HashSet<String> set = new HashSet<>();
        Scanner scan = new Scanner(System.in);
        while(scan.hasNextLine()) {
            String str = scan.nextLine();
            String[] strs = str.split(" ");
            for (String s:strs) {
                set.add(s);
            }
        }
        System.out.println(set.size());
    }
    //将一个数转换成离他最近的斐波那契数，所需要的步数一次+1或者-1
    public static int func(int key) {
       int f1 = 0;
       int f2 = 1;
       int f3 = -1;
       while(f3 < key) {
           f3 = f1+f2;
           if(f3 > key) {
               break;
           }
           f1 = f2;
           f2 = f3;
       }
       if(key-f2 > f3-key) {
           return f3 - key;
       }else {
           return key - f2;
       }
    }
    public static void main1(String[] args) {
        Scanner sc = new Scanner(System.in);
        while(sc.hasNextLine()) {
            int n= sc.nextInt();
            int ret = func(n);
            System.out.println(ret);
        }
    }

}
